Bi Objective Peer-to-Peer Ridesharing Model for Balancing Passengers Time and Costs

Promoting Peer-to-Peer Ridesharing Services as Transit System Feeders

Load Balancing in Peer-to-Peer Systems

Structured peer-to-peer (P2P) overlay networks like Distributed Hash Tables (DHTs) map data items to the network based on a consistent hashing function. Such mapping for data distribution has an inherent load balance problem. Thus, a load balancing mechanism is an indispensable part of a structured P2P overlay network for high performance. The rapid development of P2P systems has posed challeng...

LOBS: Load Balancing for Similarity Peer-to-Peer Structures

The real-life experience with the similarity search shows that this task is both difficult and very expensive in terms of processing time. The peer-to-peer structures seem to be a suitable solution for content-based retrieval in huge data collections. In these systems, the computational load generated by a query traffic is highly skewed which degrades the searching performance. Since no current...

New Algorithms for Load Balancing in Peer-to-Peer Systems

Load balancing is a critical issue for the efficient operation of peer-to-peer networks. We give new protocols for several scenarios, whose provable performance guarantees are within a constant factor of optimal. First, we give an improved version of consistent hashing, a scheme used for item to node assignments in the Chord system. In its original form, it required every network node to operat...

A Bi-Objective Approach to an Assembly Line Re-Balancing Problem: Model and Differential Evolution Algorithms

Assembly lines are special kinds of production systems which are of great importance in the industrial production of high quantity commodities. In many practical manufacturing systems, configuration of assembly lines is fixed and designing a new line may be incurred huge amount of costs and thereby it is not desirable for practitioners. When some changes related to market demand occur, it is wo...